Using Local Planar Geometric Invariants to Match and Model Images of Line Segments

Image matching consists of nding features in diierent images that represent the same feature of the observed scene. It is a basic process in vision whenever several images are used. This paper describes a matching algorithm for lines segments in two images. The key idea of the algorithm is to assume that the apparent motion between the two images can be approximated by a planar geometric transformation (a similarity or an aane transformation) and to compute such an approximation. Under such an assumption, local planar invariants related the kind of transformation used as approximation, should have the same value in both images. Such invariants are computed for simple segment conngurations in both images and matched according to their values. A global constraint is added to insure a global coherency between all the possible matches: all the local matches must deene approximately the same geometric transformation between the two images. These rst matches are veriied and completed using a better and more global approximation of the apparent motion by a planar homography, and an estimate of the epipolar geometry. If more than two images are considered, they are initially matched pairwise, then global matches are deduced in a second step. Finally, from a set of images representing diierent aspects of an object, it is possible to compare them, and to compute a model of each aspect using the matching algorithm. This work uses in a new way many elements already known in vision: some of the local planar invariants used here were presented as quasi-invariants by Binford and studied by Ben-Arie in his work on the Peaking EEect. The algorithm itself uses other ideas coming from the geometric hashing and the Hough algorithms. Its main limitations come from the invariants used. They are really stable when they are computed for a pla-nar object or for many man-made objects which contain many coplanar facets and elements. On the other hand, the algorithm will probably fail when used with images of very general polyhedrons. Its main advantages are that it still works even if the images are noisy and the polyhedral approximation of the contours is not exact, if the apparent motion between the images is not innnitesimal, if they are several diierent motions in the scene, and if the camera is uncalibrated and its motion unknown. The basic matching algorithm is presented in section 2, the veriication and completion stages in section …